Using the Proof-Checking Word Processor Lurch to Teach Proof-Writing
نویسندگان
چکیده
Lurch is a free word processor that can check the mathematical reasoning in a document.1 Although it would be easy to make a word processor that could check simple arithmetic, or even algebra, Lurch aims to do much more than that. It can check the steps of a mathematical proof, even a proof not written in a formal style. The current version works best for introduction-to-proof courses, covering topics such as logic, introductory set theory, algebra, and number theory. As we add features it becomes more able to handle a wider variety of mathematics courses. Lurch has been tested at the authors’ two institutions. Bentley University (where the first author teaches) is a selective business university of about 4,000 undergraduates and 1,500 graduate students in the greater Boston area, with a liberal arts focus. The University of Scranton (where the second author teaches) is a Jesuit university in Scranton, PA, of similar size to Bentley and also with a liberal arts focus. While Bentley has very few theoretical mathematics courses (focusing instead on the mathematics of finance and actuarial sciences), Scranton has majors in mathematics and various types of mathematics education (secondary, middle-school) and thus has several upper-division, proof-based mathematics courses.
منابع مشابه
Lurch: a word processor that can grade students' proofs
Lurch [1] is a free word processor that can check the mathematical reasoning in a document. Most notably, it can check the steps of a mathematical proof, even one not written in a formal style. The current version works best for undergraduate introduction-to-proof courses, and this paper covers our goals, current interface, and some results of classroom testing.
متن کاملLurch: a word processor built on OpenMath that can check mathematical reasoning
Lurch [5] is a free word processor that can check the mathematical reasoning in a document, including the steps of a mathematical proof, even one not written in a formal style. This paper covers our goals, implementation in terms of OpenMath, and a brief overview of the underlying validation engine.
متن کاملHow to Explain Mistakes
Usually we teach formal methods relying for a large part on one kind of reasoning technique about a formal model. For instance, we either use formal proof or we use model-checking. It would appear that it is already hard enough to learn one technique and having to cope with two puts just another burden on the students. This is not our experience. Especially model-checking is easily used to comp...
متن کاملMicroarchitecture Verification by Compositional Model Checking
Compositional model checking is used to verify a processor microarchitecture containing most of the features of a modern microprocessor, including branch prediction, speculative execution, out-of-order execution and a load-store buffer supporting re-ordering and load forwarding. We observe that the proof methodology scales well, in that the incremental proof cost of each feature is low. The pro...
متن کاملNAS A / CP - 2003 - 2 12448 Design and Application of Strategies / Tactics in Higher Order Logics
PVS (Prototype Verification System) is a comprehensive framework for writing formal logical specifications and constructing proofs. An interactive proof checker is a key component of PVS. The capabilities of this proof checker can be extended by defining proof strategies that are similar to LCF-style tactics. Commonly used proof strategies include those for discharging typechecking proof obliga...
متن کامل